2-Arc-transitive cyclic covers of K n,n −nK 2
نویسندگان
چکیده
منابع مشابه
Almost Covers Of 2-Arc Transitive Graphs
Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B with block size v. Let ΓB be the quotient graph of Γ relative to B and Γ [B,C] the bipartite subgraph of Γ induced by adjacent blocks B,C of B. In this paper we study such graphs for which ΓB is connected, (G,2)-arc transitive and is almost covered by Γ in the sense that Γ [B,C] is a matching of v−1≥2 edge...
متن کاملArc-transitive regular cyclic covers of the complete bipartite graph
Characterizing regular covers of edge-transitive or arc-transitive graphs is currently a hot topic in algebraic graph theory. In this paper, we will classify arctransitive regular cyclic covers of the complete bipartite graph Kp,p for each odd prime p. The classification consists of four infinite families of graphs. In particular, such covers exist for each odd prime p. The regular elementary a...
متن کاملA Classification of 2-Arc-Transitive Circulants
A graph X is k-arc-transitive if its automorphism group acts transitively on the set of it-arcs of X. A circulant is a Cayley graph of a cyclic group. A classification of 2-arc-transitive circulants is given.
متن کاملCountable locally 2-arc-transitive bipartite graphs
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new families of previously unknown countably infinite locally-2-arc-transitive graphs, each family containing continuum many members. These exampl...
متن کاملArc-transitive abelian regular covers of cubic graphs
Quite a lot of attention has been paid recently to the construction of edgeor arc-transitive covers of symmetric graphs. In most cases, the approach has involved voltage graph techniques, which are excellent for finding regular covers in which the group of covering transformations is either cyclic or elementary abelian, or more generally, homocyclic, but are not so easy to use when the covering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2013
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-013-0471-8